co-transformations of grammars and related transformation rules
نویسنده
چکیده
Despite of their basic role in software development, grammars are still often considered as static artifacts, used for language definition or once prepared for tool construction. Hence, there is insufficient support for working with grammars as software artifacts themselves. However, grammars are permanently changed, e.g. to debug them, to improve languages, to create grammars for tools. In [1] the authors demonstrate, how transformation tasks can be simplified, when underlying grammars are tailored especially to subtasks. The need for a discipline of grammar engineering has been emphasized by [2]. In the following, we will describe two examples of cotransformations. A co-transformation transforms mutually dependent software artifacts of different kinds simultaneously, while the transformation is centred around a grammar (or schema, API, or a similar structure) that is shared among the artifacts [3]. We are interested in consequences of grammar adaptations to transformations based on these grammars, and investigate, if the transformation rules can be migrated to work with the modified grammar.
منابع مشابه
Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions
Triple graph grammars are a successful approach to describe exogenous model transformations, i.e. transformations between models conforming to different meta-models. Source and target models are related by some connection part, triple rules describe the simultaneous construction of these parts, and forward and backward rules can be derived modeling the forward and backward model transformations...
متن کاملCompleteness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions (Long Version)
Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been investigated and applied to several case studies and they show a convenient combination of formal and intuitive specification abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules fo...
متن کاملGraph Transformations, Proofs, and Grammars
Graph transformation systems or graph grammars are a generalization of formal grammars used in linguistics.One of principal differences is that the structures that are transformed by transformation rules are no more linear. In this paper we consider graph transformation systems in connection with proof theory. We develop the graph transformation framework, where the attributes are derivable jud...
متن کاملCompleteness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions
Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been investigated and applied to several case studies and they show a convenient combination of formal and intuitive specification abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules fo...
متن کاملA Graphical Specification of Model Transformations with Triple Graph Grammars
Models and model transformations are the core concepts of OMG’s MDA approach. Within this approach, most models are derived from the MOF and have a graph-based nature. In contrast, most of the current model transformations are specified textually. To enable a graphical specification of model transformation rules, this paper proposes to use triple graph grammars as declarative specification form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004